A Quantum Algorithm for Finding the Minimum

摘要

We give a quantum algorithm to find the index y in a table T of size N suchthat in time O(c sqrt N), T[y] is minimum with probability at least 1-1/2^c.